Chebyshev’s bias in function fields
نویسنده
چکیده
We study a function field analog of Chebyshev’s bias. Our results, as well as their proofs, are similar to those of Rubinstein and Sarnak in the case of the rational number field. Following Rubinstein and Sarnak, we introduce the grand simplicity hypothesis (GSH), a certain hypothesis on the inverse zeros of Dirichlet L-series of a polynomial ring over a finite field. Under this hypothesis, we investigate how primes, that is, irreducible monic polynomials in a polynomial ring over a finite field, are distributed in a given set of residue classes modulo a fixed monic polynomial. In particular, we prove under the GSH that, like the number field case, primes are biased toward quadratic nonresidues. Unlike the number field case, the GSH can be proved to hold in some cases and can be violated in some other cases. Also, under the GSH, we give the necessary and sufficient conditions for which primes are unbiased and describe certain central limit behaviors as the degree of modulus under consideration tends to infinity, all of which have been established in the number field case by Rubinstein and Sarnak.
منابع مشابه
Chebyshev’s bias in Galois extensions of global function fields
Article history: Received 18 November 2009 Revised 6 January 2011 Accepted 15 March 2011 Available online xxxx Communicated by David Goss MSC: primary 11N05 secondary 11M38, 11G05
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملSynthesis of Four Bar Mechanisms as Function Generators by Freudenstein - Chebyshev
This paper describes new method for the synthesis of four-bar linkages for generating a required input-to-output motion. The synthesis method is based on the direct application of Chebyshev’s Alternation Theorem for the Equation of Freudenstein. By this approach the maximum structural error which corresponds to the best approximation can be estimated in advance. Two comparative examples are her...
متن کاملRearrangement Inequality and Chebyshev’s Sum Inequality on Positive Tensor Products of Orlicz Sequence Space with Banach Lattice
Let φφ be an Orlicz function that has a complementary function φφ∗ and let llφφ be an Orlicz sequence space. We prove a similar version of Rearrangement Inequality and Chebyshev’s Sum Inequality in llφφ⨂� FFXX, the Fremlin projective tensor product of llφφ with a Banach lattice X, and in llφφ⨂� iiXX, the Wittstock injective tensor product of llφφ with a Banach lattice X.
متن کاملThe Gelfond-schnirelman Method in Prime Number Theory
Abstract. The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on [0, 1] to give a Chebyshevtype lower bound in prime number theory. We study a generalization of this method for polynomials in many variables. Our main result is a lower bound for the integral of Chebyshev’s ψ-function, expressed in terms of the weighted capacity. T...
متن کامل